Apples%2Dto%2Dapples in cross%2Dvalidation studies pitfalls in classifier performance measurement.

Feature shaping for linear SVM classifiers.

Mind the gaps weighting the unknown in large%2Dscale one%2Dclass collaborative filtering.

Improving clustering stability with combinatorial MRFs.

Data weaving scaling up the state%2Dof%2Dthe%2Dart in data clustering.

Client%2DFriendly Classification over Random Hyperplane Hashes.

One%2DClass Collaborative Filtering.
This paper is motivated by the industrial research problem of designing a real-world recommender system for a large Information Technology (IT) company. Given historical records of client purchases, compactly represented as a sparse client-times-product “who-bought-what ” binary matrix, the goal is to build a model that provides recommendations for what products should be sold next to the existing client base. Such a problem may naturally be formulated as a collaborative filtering task. However, this is a one-class setting, that is, if a client has not bought a product yet, it does not imply that the client has a low propensity to potentially buy that product later. In the absence of explicitly labeled negative examples, one may resort to considering zero-valued client-product pairs as either missing data or as surrogate negative instances. In this paper, we outline an approach to explicitly deal with this kind of ambiguity by instead treating zero-valued pairs as optimization variables. These variables are optimized in conjunction with learning a weighted, low-rank non-negative matrix factorization (NMF) of the client-product matrix. The proposed algorithm alternates NMF optimization with deterministicannealing/continuation techniques designed for global minimization of combinatorial and non-convex objective functions. Experimental results show that our approach can give significantly better recommendations in comparison to various competing alternatives on a one-class collaborative filtering task.
Leveraging Web 2.0 Sources for Web Content Classification.

Real%2DTime Image Mosaic for Endoscopic Video Sequences.
Abstract. We present an algorithm capable of making in real time image mosaics with enlarged field-of-view from the endoscopic video data stream. The algorithm is based on the method of Kourogi et al. (1999) which we extend to the case of endoscopic masks. The algorithm automatically finds the optimal affine transform between video frames and builds the enlarged field-of-view as an intervention-free side task. We apply our algorithm to endoscopic video sequences and compare it to the well-known image-mosaicing algorithm of Szeliski (1994). Our method turns out to be more robust, more than 3 times faster, having at the same time a 4 times smaller average motion estimation error: 0.19 pixel instead of 0.72 pixel between successive frames. 1
Setup X %2D A Public Study Design Database for Metabolomic Projects.
Metabolomic databases are useless without accurate description of the biological study design and accompanying metadata reporting on the laboratory workflow from sample preparation to data processing. Here we report on the implementation of a database system that enables investigators to detail and set up a biological experiment, and that also steers laboratory workflows by direct access to the data acquisition instrument. SetupX utilizes orthogonal biological parameters such as genotype, organ, and treatment(s) for delineating the dimensions of a study which define the number of classes under investigation. Publicly available taxonomic and ontology repositories are utilized to ensure data integrity and logic consistency of class designs. Class descriptions are subsequently employed to schedule and randomize data acquisitions, and to deploy metabolite annotations carried out by the seamlessly integrated mass spectrometry database, BinBase. Annotated result data files are housed by SetupX for downloads and queries. Currently, 39 users have generated 48 studies, some of which are made public. 1. Metabolomic DBs require metadata on study designs Metabolomic data can only be interpreted on the basis of background
Boosting classifiers for drifting concepts.
This paper proposes a boosting-like method to train a classifier ensemble from data streams. It naturally adapts to concept drift and allows to quantify the drift in terms of its base learners. The algorithm is empirically shown to outperform learning algorithms that ignore concept drift. It performs no worse than advanced adaptive time window and example selection strategies that store all the data and are thus not suited for mining massive streams.
Boosting in PN Spaces.
This paper analyzes boosting in unscaled versions of ROC  spaces, also referred to as PN spaces. A minor revision to AdaBoost&#039;s  reweighting strategy is analyzed, which allows to reformulate it in terms  of stratification, and to visualize the boosting process in nested PN  spaces as known from divide-and-conquer rule learning. The analyzed  confidence-rated algorithm is proven to take more advantage of its base  models in each iteration, although also searching a space of linear discrete  base classifier combinations. The algorithm reduces the training  error quicker without lacking any of the advantages of original AdaBoost.
YALE rapid prototyping for complex data mining tasks.
KDD is a complex and demanding task. While a large number of methods has been established for numerous problems, many challenges remain to be solved. New tasks emerge requiring the development of new methods or processing schemes. Like in software development, the development of such solutions demands for careful analysis, specification, implementation, and testing. Rapid prototyping is an approach which allows crucial design decisions as early as possible. A rapid prototyping system should support maximal re-use and innovative combinations of existing methods, as well as simple and quick integration of new ones.
Distributed Subgroup Mining.

Setup and Annotation of Metabolomic Experiments by Integrating Biological and Mass Spectrometric Metadata.

On the Tractability of Rule Discovery from Distributed Data.
This paper analyses the tractability of rule selection for supervised learning in distributed scenarios. The selection of rules is usually guided by a utility measure such as predictive accuracy or weighted relative accuracy. A common strategy to tackle rule selection from distributed data is to evaluate rules locally on each dataset. While this works well for homogeneously distributed data, this work proves limitations of this strategy if distributions are allowed to deviate. The identification of those subsets for which local and global distributions deviate, poses a learning task of its own, which is shown to be at least as complex as discovering the globally best rules from local data.
Sampling%2Dbased sequential subgroup mining.
Subgroup discovery is a learning task that aims at finding interesting rules from classified examples. The search is guided by a utility function, trading o# the coverage of rules against their statistical unusualness. One shortcoming of existing approaches is that they do not incorporate prior knowledge. To this end a novel generic sampling strategy is proposed. It allows to turn pattern mining into an iterative process. In each iteration the focus of subgroup discovery lies on those patterns that are unexpected with respect to prior knowledge and previously discovered patterns. The result of this technique is a small diverse set of understandable rules that characterise a specified property of interest. As another contribution this article derives a simple connection between subgroup discovery and classifier induction. For a popular utility function this connection allows to apply any standard rule induction algorithm to the task of subgroup discovery after a step of stratified resampling. The proposed techniques are empirically compared to state of the art subgroup discovery algorithms.
Knowledge%2DBased Sampling for Subgroup Discovery.
Subgroup discovery aims at finding interesting subsets of a  classified example set that deviates from the overall distribution. The  search is guided by a so-called utility function, trading the size of subsets  (coverage) against their statistical unusualness. By choosing the utility  function accordingly, subgroup discovery is well suited to find interesting  rules with much smaller coverage and bias than possible with standard  classifier induction algorithms. Smaller subsets can be considered  local patterns, but this work uses yet another definition: According to  this definition global patterns consist of all patterns reflecting the prior  knowledge available to a learner, including all previously found patterns.
KDD%2DCup 2004 protein homology task.



The MiningMart Approach.
Although preprocessing is one of the key issues in data analysis, it is still common practice to address this task by manually entering SQL statements and using a variety of stand-alone tools. The results are not properly documented and hardly re-usable. The MiningMart system presented in this chapter focusses on setting up and re-using best-practice cases of preprocessing data stored in very large databases. A meta-data model named M4 is used to declaratively define and document both, all steps of such a preprocessing chain and all the data involved. For data and applied operators there is an abstract level, understandable by human users, and an executable level, used by the meta-data compiler to run cases for given data sets. An integrated environment allows for a rapid development of preprocessing chains. Case adaptation to different environments is supported by just specifying all involved database entities in the target DBMS. This allows to re-use best-practice cases published on the Internet. 1 Acquiring Knowledge from Existing Databases The use of very large databases has enhanced in the last years from supporting transactions to additionally reporting business trends. The interest in analyzing the data has increased. One important topic is customer relationship management with the particular tasks of customer segmentation, customer profitability, customer retention, and customer acquisition (e.g. by direct mailing). Other tasks are the prediction of sales in order to minimize stocks, the prediction of electricity consumption or telecommunication services at particular day times in order to minimize the use of external services or optimize network routing, respectively. The health sector demands several analysis tasks for resource management, quality control, ...
Craniofacial growth disturbances after frontobasal trauma and craniotomy at the age of 4 years %2D implications for the timing of CAD%2FCAM%2Dcranioplasties.

A transport protocol for native mode ATM networks design and implementation.

Abstraktion und Naturalismus in der Praxis der digitalen Bildherstellung.

